منابع مشابه
Sequential Matching Estimation of Dynamic Causal Models
Sequential Matching Estimation of Dynamic Causal Models This paper proposes sequential matching and inverse selection probability weighting to estimate dynamic causal effects. The sequential matching estimators extend simple, matching estimators based on propensity scores for static causal analysis that have been frequently applied in the evaluation literature. A Monte Carlo study shows that th...
متن کاملEstimating Sequential Search Models using MPEC
The dynamic programming approach of Weitzman (1979) has recently been used in several papers estimating consumer sequential search (Kim et al., 2010; Ghose et al. 2012; Honka and Chintagunta, 2014; Chen and Yao, 2014). The popularity of this method owes to its ability to exactly characterize the sequence of choices made by consumers. However, in order to characterize this sequence, knowledge of...
متن کاملAsymptotic Theorems of Sequential Estimation - Adjusted Urn Models
The Generalized Pólya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential estimation-adjusted urn model (a nonhomogeneous GPU) which has a wide spectrum of applications. Because the proposed urn model depends on sequential estimations of unknown...
متن کاملEstimation of Runoff using Modified SCS Models
In recent decades, due to the importance of watershed management programs and the need for adequate information and correct estimation of rainfall and runoff, many conceptual models have been proposed. These models have parameters that must be estimated according to observational data. However, finding the optimal values for the parameters of simulation models has always faced uncertainty. One ...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3203973